%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SET194^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 14:45:59 EDT 2023

% Result   : Theorem 3.36s 3.59s
% Output   : Proof 3.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.16  % Problem    : SET194^5 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.18  % Command    : duper %s
% 0.17/0.39  % Computer : n007.cluster.edu
% 0.17/0.39  % Model    : x86_64 x86_64
% 0.17/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39  % Memory   : 8042.1875MB
% 0.17/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39  % CPULimit   : 300
% 0.17/0.39  % WCLimit    : 300
% 0.17/0.39  % DateTime   : Sat Aug 26 14:07:57 EDT 2023
% 0.17/0.39  % CPUTime    : 
% 3.36/3.59  SZS status Theorem for theBenchmark.p
% 3.36/3.59  SZS output start Proof for theBenchmark.p
% 3.36/3.59  Clause #0 (by assumption #[]): Eq (Not (∀ (X Y : a → Prop) (Xx : a), X Xx → Or (X Xx) (Y Xx))) True
% 3.36/3.59  Clause #1 (by clausification #[0]): Eq (∀ (X Y : a → Prop) (Xx : a), X Xx → Or (X Xx) (Y Xx)) False
% 3.36/3.59  Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop), Eq (Not (∀ (Y : a → Prop) (Xx : a), skS.0 0 a_1 Xx → Or (skS.0 0 a_1 Xx) (Y Xx))) True
% 3.36/3.59  Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop), Eq (∀ (Y : a → Prop) (Xx : a), skS.0 0 a_1 Xx → Or (skS.0 0 a_1 Xx) (Y Xx)) False
% 3.36/3.59  Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop), Eq (Not (∀ (Xx : a), skS.0 0 a_1 Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))) True
% 3.36/3.59  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop), Eq (∀ (Xx : a), skS.0 0 a_1 Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) False
% 3.36/3.59  Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.36/3.59    Eq
% 3.36/3.59      (Not
% 3.36/3.59        (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3) →
% 3.36/3.59          Or (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))))
% 3.36/3.59      True
% 3.36/3.59  Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.36/3.59    Eq
% 3.36/3.59      (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3) → Or (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))
% 3.36/3.59      False
% 3.36/3.59  Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) True
% 3.36/3.59  Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.36/3.59    Eq (Or (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) False
% 3.36/3.59  Clause #11 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False
% 3.36/3.59  Clause #12 (by superposition #[11, 8]): Eq False True
% 3.36/3.59  Clause #13 (by clausification #[12]): False
% 3.36/3.59  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------